Multiresource Malleable Task Scheduling
نویسندگان
چکیده
We present a technique for generalizing previously known results for single resource task systems to multiresource malleable task systems: Assuming a system with s resources, we apply a transformation which maps the system into a single resource task system. For a large class of heuristics it is shown, that given a heuristic H which achieves a suboptimality bound of c H with respect to the optimal makespan/average response time in a single resource system, the proposed transformation yields an algorithm with a suboptimality bound of c H s with respect to the optimal makespan/average response time for the multiresource system.
منابع مشابه
The Power of Choice in Scheduling Parallel Tasks
A malleable parallel task is one that can be executed on any number of processors, with its execution time being a function of the number of processors allotted to it. A nonmalleable parallel task is one that requires a speciic number of processors. Given n independent parallel tasks and m identical processors, we consider the problem of scheduling these tasks to minimize average completion tim...
متن کاملEfficient max-min and proportional fair constrained multiresource scheduling
We consider the problem of scheduling a group of heterogeneous, distributed processes, with different relative priorities and service preferences, to a group of heterogeneous virtual machines. Assuming linearly elastic IT resource needs, we extend prior results on proportional fair and max-min fair scheduling to a constrained multiresource case for a fam- ily of fairness criteria (including our...
متن کاملScheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
We study two related problems in non-preemptive scheduling and packing of malleable tasks with precedence constraints to minimize the makespan. We distinguish the scheduling variant, in which we allow the free choice of processors, and the packing variant, in which a task must be assigned to a contiguous subset of processors. For precedence constraints of bounded width, we completely resolve th...
متن کاملScheduling and packing malleable and parallel tasks with precedence constraints of bounded width
We study the problems of non-preemptively scheduling and packing malleable and parallel tasks with precedence constraints to minimize the makespan. In the scheduling variant, we allow the free choice of processors; in packing, each task must be assigned to a contiguous subset. Malleable tasks can be processed on different numbers of processors with varying processing times, while parallel tasks...
متن کاملLookahead Scheduling for Reconfigurable GRID Systems
This paper proposes an approach to continuously optimizing parallel scientific applications with dynamically changing architectures. We achieve this by combining a dynamic architecture and lookahead malleable task graph scheduling.
متن کامل